Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms

نویسندگان

  • Didier Dubois
  • Daniel Le Berre
  • Henri Prade
  • Régis Sabbadin
چکیده

This paper describes a logical machinery for computing decisions, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels), and where the preferences of the user are also described by another possibilistic logic base whose formula weights are interpreted in terms of priorities. Two attitudes are allowed for the decision maker: a pessimistic risk-averse one and an optimistic one. The computed decisions are in agreement with a qualitative counterpart to the classical theory of expected utility, recently developed by three of the authors. A link is established between this logical view of qualitative decision making and an ATMS-based computation procedure. EEcient algorithms for computing pessimistic and optimistic optimal decisions are nally given in this logical setting (using some previous work of the fourth author).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical Representation and Computation of Optimal Decisions in a Qualitative Setting

This paper describes a logical machinery for computing decisions based on an ATMS procedure, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels). The preferences of the user are also described by another possibilistic logic base whose formula weigh...

متن کامل

Logical representation and computation of optimal decisions in

This paper describes a logical machinery for computing decisions based on an ATMS procedure, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels). The preferences of the user are also described by another possibilistic logic base whose formula weigh...

متن کامل

Hypothetical Reasoning in Possibilistic Logic: Basic Notions, Applications and Implementation Issues

Possibilistic ATMS are truth maintenance systems oriented towards hypothetical reasoning where both assumptions and justifications can bear an uncertainty weight. Uncertainty is represented in the framework of possibility theory. In possibilistic logic uncertain clauses are handled as such and then in possibilistic ATMS the management of uncertainty is not separated from the other classical cap...

متن کامل

Using Syntactic Possibilistic Fusion for Modeling Optimal Optimistic Qualitative Decision

This paper describes the use of syntactical data fusion to computing possibilistic qualitative decisions. More precisely qualitative possibilistic decisions can be viewed as a data fusion problem of two particular possibility distributions (or possibilistic knowledge bases): the first one representing the beliefs of an agent and the second one representing the qualitative utility. The proposed ...

متن کامل

Answer Set Programming for Computing Decisions Under Uncertainty

Possibility theory offers a qualitative framework for modeling decision under uncertainty. In this setting, pessimistic and optimistic decision criteria have been formally justified. The computation by means of possibilistic logic inference of optimal decisions according to such criteria has been proposed. This paper presents an Answer Set Programming (ASP)-based methodology for modeling decisi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 37  شماره 

صفحات  -

تاریخ انتشار 1999